Wilf-equivalence for singleton classes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wilf-equivalence for Singleton Classes

Write p1p2 : : : pm for the permutation matrix p i ;j. Let Sn(M) be the set of n n permutation matrices which do not contain the m m permutation matrix M as a submatrix. In 2] Simion and Schmidt show bijectively that jSn(123)j = jSn(213)j. In the present work this is generalised to a bijection between Sn result was established for t = 2 in 5] and for t = 3 in 8].

متن کامل

Descent c-Wilf Equivalence

Let Sn denote the symmetric group. For any σ ∈ Sn, we let des(σ) denote the number of descents of σ, inv(σ) denote the number of inversions of σ, and LRmin(σ) denote the number of left-to-right minima of σ. For any sequence of statistics stat1, . . . , statk on permutations, we say two permutations α and β in Sj are (stat1, . . . statk)-c-Wilf equivalent if the generating function of ∏k i=1 x s...

متن کامل

On Wilf Equivalence for Alternating Permutations

In this paper, we obtain several new classes of Wilf-equivalent patterns for alternating permutations. In particular, we prove that for any nonempty pattern τ , the patterns 12 . . . k ⊕ τ and k . . . 21 ⊕ τ are Wilf-equivalent for alternating permutations, paralleling a result of Backelin, West, and Xin for Wilf-equivalence for

متن کامل

Wilf Equivalence in Interval Embeddings

Consider the alphabet A and define A∗ as the set of words over A. Define a vector of sequences of subsets of N as ~u = (u1, u2, . . . , uk). Consider a word w ∈ A∗. Define their to be an embedding of ~u in w, ~u ≤ w if there is some i such that, wi ∈ uj , wi+1 ∈ uj+1, . . . wi+k−1 ∈ uj+k−1. Define a word that avoids the vector ~u as a word where there is no such i, such that wi ∈ uj , wi+1 ∈ uj...

متن کامل

Egge triples and unbalanced Wilf equivalence

Egge, in a talk at the AMS Fall Eastern Meeting, 2012, conjectured that permutations avoiding the set of patterns {2143, 3142, τ}, where τ ∈ {246135, 254613, 524361, 546132, 263514}, are enumerated by the large Schröder numbers (and thus {2143, 3142, τ} with τ as above is Wilfequivalent to the set of patterns {2413, 3142}). Burstein and Pantone [J. Combin. 6 (2015) no. 1-2, 55–67] proved the ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2007

ISSN: 0196-8858

DOI: 10.1016/j.aam.2004.11.006